A Min-Cut-Based Simulated Annealing Algorithm for Graph Bisection
نویسندگان
چکیده
منابع مشابه
Simulated Annealing for Graph Bisection
W e resolve in the aff irmative a question of Boppana and B u i : whether simulated annealing can, w i th high probability and in polynomial t i m e , f ind the optimal bisection of a r a n d o m graph in Gnpr when p r = O(n*-’) f o r A 5 2 . ( T h e random graph model Gnpr specifies a “planted” bisection of density r , separating t w o n / 2 v e r t e x subsets of slightly higher density p . )...
متن کاملBetween Min Cut and Graph Bisection between Min Cut and Graph Bisection
We investigate a class of graph partitioning problems whose two extreme representatives are the well-known Min Cut and Graph Bisection problems. The former is known to be eeciently solvable by ow techniques, the latter to be NP-complete. The results presented in this paper are { a monotony result of the type \The more balanced the partition we look for has to be, the harder the problem". { a co...
متن کاملSIMULATED ANNEALING ALGORITHM FOR SELECTING SUBOPTIMAL CYCLE BASIS OF A GRAPH
The cycle basis of a graph arises in a wide range of engineering problems and has a variety of applications. Minimal and optimal cycle bases reduce the time and memory required for most of such applications. One of the important applications of cycle basis in civil engineering is its use in the force method to frame analysis to generate sparse flexibility matrices, which is needed for optimal a...
متن کاملSimulated Annealing Algorithm for Graph Coloring
The goal of this Random Walks project is to code and experiment the Markov Chain Monte Carlo (MCMC) method for the problem of graph coloring. In this report, we present the plots of cost function H by varying the parameters like q (Number of colors that can be used in coloring) and c (Average node degree). The results are obtained by using simulated annealing scheme, where the temperature (inve...
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energy Procedia
سال: 2011
ISSN: 1876-6102
DOI: 10.1016/j.egypro.2011.11.144